Kripke-Style Semantics for Non-Commutative Monoidal t-Norm Logic

نویسنده

  • Denisa Diaconescu
چکیده

A t-norm is a binary operation on [0, 1] that is associative, commutative, with identity 1 and non-decreasing in both argument. The notion of t-norm is very important in the context of fuzzy logic, for it is used in modeling a general form of the propositional conjunction. The basic fuzzy logic (BL logic) was introduced by Hájek in [9,10] and it was inspired by a continuous t-norm and its residual. If the continuity hypothesis is weakened, by replacing it with left-continuity (a necessary and sufficient condition for a t-norm to have a residuum), then we obtain a different fuzzy logic, namely monoidal t-norm based logic (MTL logic) introduced by Esteva and Godo in [2]. In the algebraic framework, the algebras corresponding to BL logic are called BL algebras [10] and they are residuated lattices with two new properties: the divisibility condition and the prelinearity condition. MTL algebras [2], the algebraic structures for MTL logic, are a generalization of BL algebras by dropping down the divisibility condition. MTL algebras are also known under the name of weak BL algebras [4].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressivity properties of Boolean BI through relational models

In this paper, we study Boolean BI Logic (BBI) from a semantic perspective. This logic arises as a logical basis of some recent separation logics used for reasoning about mutable data structures and we aim at proposing new results from alternative semantic foundations for BBI that seem to be necessary in the context of modeling and proving program properties. Starting from a Kripke relational s...

متن کامل

Fleas and fuzzy logic: a survey

Keywords: mathematical fuzzy logic, basic fuzzy logic, monoidal t-norm logic, hoop logic, non-commutative fuzzy logic. This paper is a companion to my [12]. The latter is a rather technical paper developing a generalized (mathematical) fuzzy logic. Main definitions and results of [12] are reproduced here without any proofs; but this is preceded by a survey on the basic proposi-tional fuzzy logi...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Standard completeness theorem for PiMTL

ΠMTL is a schematic extension of the monoidal t-norm based logic (MTL) by the characteristic axioms of product logic. In this paper we prove that ΠMTL satisfies the standard completeness theorem. From the algebraic point of view, we show that the class of ΠMTL-algebras (bounded commutative cancellative residuated l-monoids) in the real unit interval [0, 1] generates the variety of all ΠMTL-alge...

متن کامل

On strongly standard complete fuzzy logics: MTL∗ and its expansions

Finding strongly standard complete axiomatizations for t-norm based fuzzy logics (i.e. complete for deductions with infinite sets of premises w.r.t. semantics on the real unit interval [0, 1]) is still an open problem in general, even though results are already available for some particular cases like some infinitary logics based on a continuous t-norm or certain expansions of Monoidal t-norm b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Multiple-Valued Logic and Soft Computing

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2010